Multi-Cluster Based Temporal Mobile Sequential Pattern Mining Using Heuristic Search

نویسنده

  • M. I. THARIQ HUSSAN
چکیده

An enhanced mobile sequential pattern mining using heuristic search technique is explored to predict mobile user’s behavior effectively. By analyzing the movement of mobile users with respect to time, location and service request, one can contend that users in different user groups may have different mobile transaction behavior. Similar transaction behavior in a set is grouped by applying heuristic search technique. The heuristic search technique efficiently performs search on mobile transaction database to prune undesired transaction to form cluster and make them refined, meaningful, and relevant to the query. Research on multicluster based sequential pattern mining has been emerging in recent years due to a wide range of potential applications. One of the active topics is the facilitation of wireless and web technologies to the mobile user’s through the usage of mobile devices at anytime and anywhere. This approach has been evaluated with the transactional dataset and simulation is carried out with data obtained from the real world to generate the required network environment. Compared with Cluster-based Temporal Mobile Sequential Pattern (CTMSP), the evaluation results show that Multi-Cluster based Temporal Mobile Sequential Pattern using Heuristic Search (MCTMSPHS) achieves 30 to 40% more in accuracy, 40 to 50% less in energy usage and 20 to 25% less in execution time. Key-Words: Mobile Sequential Pattern Mining, Heuristic Search, Clustering, Mobile Environment

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Temporal Sequential Pattern Mining Scheme for Mobile Services

Researches on Location-Based Service (LBS) have been emerging in recent years due to a wide range of potential applications. One of the active topics is the mining and prediction of mobile movements and associated transactions. Most of existing studies focus on discovering mobile patterns from the whole logs. However, this kind of patterns may not be precise enough for predictions since the dif...

متن کامل

Performance Analysis of Temporal Mobile Sequential Patterns in Location Based Service

This paper presents an Associative Relational Mobile Transaction Sequential Pattern Mining (ARM-TSPM) to extract the hidden information in location based service environment. Major problem in the cluster analysis is determining the cluster in unlabeled data. It is overcome by Dark Block Extraction (DBE) method to automatically determine the number of clusters but lacks in processing the full-se...

متن کامل

First-Order Temporal Pattern Mining with Regular Expression Constraints

Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequential patterns, such as the multi-sequential patterns, whose specification needs a more expressive formalism, the first-order temporal logic. In this paper, we extend a well-known user-controlled tool, based on regular ...

متن کامل

Improved Sequential Pattern Mining Using an Extended Bitmap Representation

The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm was proposed in SIGKDD’2002, which utilized a depth-first traversal on the search space combined with a vertical bitmap representation to provide efficient support counting. According to its experimental results, SPAM o...

متن کامل

Sequential Pattern Mining by Pattern-Growth: Principles and Extensions

Sequential pattern mining is an important data mining problem with broad applications. However, it is also a challenging problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Recent studies have developed two major classes of sequential pattern mining methods: (1) a candidate generation-and-test approach, represented by (i) GSP...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014